Adaptive Packet Routing for Bursty Adversarial Traffic

Adaptive Packet Routing for Bursty Adversarial Tra c

One of the central tasks of networking is packet-routing when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual sub-problems: path selection and congestion resolution along the selected paths. However, this conceptual separation has a serious drawback: each packet's path is xed at the source and cannot be modi ed adaptively e...

Packet Multiplexers with Adversarial Regulated Traffic

Load Balancing in Internet Using Adaptive Packet Scheduling and Bursty Traffic Splitting

In this paper, we propose an architecture for load balancing, which contains an adaptive packet scheduler with a bursty traffic splitting algorithm. The scheduler has one classifier which classifies the flows into aggressive and normal flow. Aggressive flows are treated as high priority flows. Based on the buffer occupancy threshold, a trigger handler checks for load unbalance of the network an...

The impact of bursty traffic on FPCF packet switch performance

This paper analyses and compares the performance of forward planning conflict-free (FPCF), virtual output queuing-partitioned (VOQ-P) and virtual output queuing-shared (VOQ-S) packet switches. The influence of packet burst size, offered switch load and packet switch size are all investigated. Packet loss probability, average packet delay and 99.9% packet delay values are also derived. In compar...

Traffic Metrics for Adaptive Routing

OF THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN ELECTRICAL ENGINEERING UNIVERSITY OF MASSACHUSETTS-LOWELL